An Overview of Networked Control of Complex Dynamic Systems
نویسندگان
چکیده
منابع مشابه
development and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولMarkovian Delay Prediction-Based Control of Networked Systems
A new Markov-based method for real time prediction of network transmission time delays is introduced. The method considers a Multi-Layer Perceptron (MLP) neural model for the transmission network, where the number of neurons in the input layer is minimized so that the required calculations are reduced and the method can be implemented in the real-time. For this purpose, the Markov process order...
متن کاملNeural-Smith Predictor Method for Improvement of Networked Control Systems
Networked control systems (NCSs) are distributed control systems in which the nodes, including controllers, sensors, actuators, and plants are connected by a digital communication network such as the Internet. One of the most critical challenges in networked control systems is the stochastic time delay of arriving data packets in the communication network among the nodes. Using the Smith predic...
متن کاملNetworked Control System – An Overview
Networked Control System (NCS) is fetching researchers' interest from many decades. It's been used in industry which range from manufacturing, automobile, aviation, aerospace to military. This paper gives the general architecture of NCS and its fundamental routes. It also touches to its advantages and disadvantages and some of the popular controller which include PID (Proportional-Int...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/794096